Computing spectral sequences
نویسندگان
چکیده
In this paper, a set of programs enhancing the Kenzo system is presented. Kenzo is a Common Lisp program designed for computing in Algebraic Topology, in particular it allows the user to calculate homology and homotopy groups of complicated spaces. The new programs presented here entirely compute Serre and EilenbergMoore spectral sequences, in particular the E p,q and d r p,q for arbitrary r. They also determine when E p,q = E ∞ p,q and describe the filtration of the target homology groups Hp+q by the E ∞ p,q’s.
منابع مشابه
Chebyshev Spectral Collocation Method for Computing Numerical Solution of Telegraph Equation
In this paper, the Chebyshev spectral collocation method(CSCM) for one-dimensional linear hyperbolic telegraph equation is presented. Chebyshev spectral collocation method have become very useful in providing highly accurate solutions to partial differential equations. A straightforward implementation of these methods involves the use of spectral differentiation matrices. Firstly, we transform ...
متن کاملAnalysis of High-order Approximations by Spectral Interpolation Applied to One- and Two-dimensional Finite Element Method
The implementation of high-order (spectral) approximations associated with FEM is an approach to overcome the difficulties encountered in the numerical analysis of complex problems. This paper proposes the use of the spectral finite element method, originally developed for computational fluid dynamics problems, to achieve improved solutions for these types of problems. Here, the interpolation n...
متن کاملHigher K-theory of Toric Stacks
In this paper, we develop several techniques for computing the higher G-theory and K-theory of quotient stacks. Our main results for computing these groups are in terms of spectral sequences. We show that these spectral sequences degenerate in the case of many toric stacks, thereby providing an efficient computation of their higher K-theory. We apply our main results to give explicit descriptio...
متن کاملOn codes with local joint constraints
We study the largest number of sequences with the property that any two sequences do not contain specified pairs of patterns. We show that this number increases exponentially with the length of the sequences and that the exponent, or capacity, is the logarithm of the joint spectral radius of an appropriately defined set of matrices. We illustrate a new heuristic for computing the joint spectral...
متن کاملA spectral method based on Hahn polynomials for solving weakly singular fractional order integro-differential equations
In this paper, we consider the discrete Hahn polynomials and investigate their application for numerical solutions of the fractional order integro-differential equations with weakly singular kernel .This paper presented the operational matrix of the fractional integration of Hahn polynomials for the first time. The main advantage of approximating a continuous function by Hahn polynomials is tha...
متن کاملSpectral Sequences for the Classification of Extensions of Hopf Algebras
We construct spectral sequences which provide a way to compute the cohomology theory that classifies extensions of graded connected Hopf algebras over a commutative ring as described by William M. Singer. Specifically, for (A,B) an abelian matched pair of graded connected R-Hopf algebras, we construct a pair of spectral sequences relating H∗(B,A) to Ext∗,∗ B (R,Cotor ∗,∗ A (R,R)). To illustrate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 41 شماره
صفحات -
تاریخ انتشار 2006